Quorums from Diierence Covers
نویسنده
چکیده
Maekawa considered a simple but suboptimal grid-based quorum generation scheme in which N sites in the network are logically organized in the form of a p N p N grid, and the quorum sets are row-column pairs. Even though the quorum size 2 p N of the grid scheme is twice as large as nite projective plane with optimal sized quorums, it has the advantage of being simple and geometrically evident. Agrawal, EE gecioo glu, and El Abbadi proposed another grid based scheme producing quorums of size p 2N. In this note, a very simple construction is given to produce a system of quorums of size p 1:5N. These are easily veriied, and can be generated eeciently.
منابع مشابه
Two New Quorum Based Algorithms for
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modiication of Maekawa's grid based quorum scheme. The size of quorums is approximately p 2 p N where N is the number of sites in a network, as compared to 2 p N of the original method. The method is simple and geometrically evident. The second one is based on the idea of diierence set...
متن کاملFlexible Paxos: Quorum Intersection Revisited
Distributed consensus is integral to modern distributed systems. The widely adopted Paxos algorithm uses two phases, each requiring majority agreement, to reliably reach consensus. In this paper, we demonstrate that Paxos, which lies at the foundation of many production systems, is conservative. Specifically, we observe that each of the phases of Paxos may use non-intersecting quorums. Majority...
متن کاملApproval quorums dominate participation quorums
We study direct democracy with population uncertainty. Voters’ participation is often among the desiderata by the election designer. A participation quorum is a threshold on the fraction of participating voters below which the status quo is kept. We show that participation quorums produce incentive for partisans of the status quo to abstain, with the consequence that the status quo may be kept ...
متن کاملA Fault-Tolerant Algorithm for Decentralized On-line Quorum Adaptation
A quorum-based distributed mutual exclusion protocol requires each processor in a distributed system to obtain permission from a quorum of processors before accessing a resource that cannot be concurrently shared. To prevent failed quorum members from blocking access to the resource, it is desirable to remove failed processors from quorums when failures are detected. This work addresses the pro...
متن کاملQuaternary dichotomous voting rules
In this paper we provide a general model of quaternarydichotomous voting rules (QVRs), namely, voting rules for making collective dichotomous decisions (to accept or reject a proposal), based on vote pro les in which four options are available to each voter: voting (yes, noor abstaining) or staying home and not turning out. The model covers most of actual real-world dichotomus rules, wh...
متن کامل